对自由落体的诺维科夫时间与牛顿绝对时间关系讨论

文章首先将史瓦西黑洞场中自由下落质点的固有时(诺维科夫坐标时)公式,由自然单位制化成了国际单位制中的形式.然后,根据牛顿第二定律和万有引力定律,推导出了自由下落质点经历的绝对时间公式,进而证明了广义相对论中自由落体经历的固有时,恰好等于牛顿力学给出的绝对时间.最后,对自由下落质点在黑洞内外经历的时间进行了特例计算.     

基于特征正交分解的一类瞬态非线性热传导问题的新型快速分析方法

提出了一种基于特征正交分解(POD)和有限元法的瞬态非线性热传导问题的模型降阶快速分析方法, 建立了导热系数随温度变化的一类瞬态非线性热传导问题有限元格式的POD降阶模型. 在隐式时间推进方法的基础上有效结合单元预转换方法和多级线性化方法发展了一种加速求解瞬态非线性热传导降阶模型的新型计算方法,并通过二维和三维算例验证了该方法的准确性和高效性. 研究结果表明: (1)降阶模型解的均方根误差在经过初始时段轻微的脉动后稳定于0.01%以下, 而其计算效率比有限元全阶模型提高2$\sim $3个数量级, 并且自由度数量(DOFs)愈大提高的幅度也愈加显著; (2)新型算法解决了常规算法在计算非线性降阶模型时加速性能差的问题, 即使是在DOFs比较小的时候也能够明显提高计算效率; (3)常数边界条件下得到的POD模态可以用来建立相同求解域在各种复杂时变边界条件下的瞬态非线性热传导降阶模型, 并对其传热过程和温度场进行快速准确的分析与预测, 具有很好的工程应用价值.      

双子佯谬与星际航行

计算了在两个假想的星际航行方案中,与"双子佯谬"相关的时间差别.这种差别体现了惯性与非惯性参考系经历的时间有绝对差异,而不再是"相对"效应.     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

Further study of alternating iterations for rectangular matrices

Theory of matrix splittings is a useful tool in the analysis of iterative methods for solving systems of linear equations. When two splittings are given, it is of interest to compare the spectral radii of the corresponding iteration matrices. This helps to arrive at the conclusion that which splitting should one choose so that one can reach the desired solution of accuracy or the exact solution in a faster way. In the case of many splittings are provided, the comparison of the spectral radii is time-consuming. Such a situation can be overcome by introducing another iteration scheme which converges to the same solution of interest in a much faster way. In this direction, the theory of alternating iterations for real rectangular matrices is recently proposed. In this note, some more results to the theory of alternating iterations are added. A comparison result of two different alternating iteration schemes is then presented which will help us to choose the iteration scheme that will guarantee the faster convergence of the alternating iteration scheme. In addition to these results, a comparison result for proper weak regular splittings is also obtained.     

�������ֲ������¶�Ԫ����ģ���к����������

In Bayesian analysis, the Markov Chain Monte Carlo (MCMC) algorithm is an efficient and simple method to compute posteriors. However, the chain may appear to converge while the posterior is improper, which will leads to incorrect statistical inferences. In this paper, we focus on the necessary and sufficient conditions for which improper hierarchical priors can yield proper posteriors in a multivariate linear model. In addition, we carry out a simulation study to illustrate the theoretical results, in which the Gibbs sampling and Metropolis-Hasting sampling are employed to generate the posteriors.     

Reconstruction of the Linear Ordinary Differential System Based on Discrete Points

In this paper, we discuss an inverse problem, i.e., the reconstruction of a linear differential dynamic system from the given discrete data of the solution. We propose a model and a corresponding algorithm to recover the coefficient matrix of the differential system based on the normal vectors from the given discrete points, in order to avoid the problem of parameterization in curve fitting and approximation. We also give some theoretical analysis on our algorithm. When the data points are taken from the solution curve and the set composed of these data points is not degenerate, the coefficient matrix $A$ reconstructed by our algorithm is unique from the given discrete and noisefree data. We discuss the error bounds for the approximate coefficient matrix and the solution which are reconstructed by our algorithm. Numerical examples demonstrate the effectiveness of the algorithm.     

Simulation of the interaction of light with 3-D metallic nanostructures using a proper orthogonal decomposition-Galerkin reduced-order discontinuous Galerkin time-domain method

In this artice, we report on a reduced-order model (ROM) based on the proper orthogonal decomposition (POD) technique for the system of 3-D time-domain Maxwell's equations coupled to a Drude dispersion model, which is employed to describe the interaction of light with nanometer scale metallic structures. By using the singular value decomposition (SVD) method, the POD basis vectors are extracted offline from the snapshots produced by a high order discontinuous Galerkin time-domain (DGTD) solver. With a Galerkin projection and a second order leap-frog (LF₂) time discretization, a discrete ROM is constructed. The stability condition of the ROM is then analyzed. In particular, when the boundary is a perfect electric conductor condition, the global energy of the ROM is bounded, which is consistent with the characteristics of global energy in the DGTD method. It is shown that the ROM based on Galerkin projection can maintain the stability characteristics of the original high dimensional model. Numerical experiments are presented to verify the accuracy, demonstrate the capabilities of the POD-based ROM and assess its efficiency for 3-D nanophotonic problems.     

图的邻点全和可区别全染色

设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。     

本征正交分解技术在屋盖风压场重建与预测中的应用

给出利用本征正交分解(POD)对屋盖风压场进行重建和预测的研究结果.对一个双坡屋盖用同步多点压力扫描系统进行了风洞试验,根据POD技术采用前若干阶本征模态重建屋盖风压场.采用两种方案预测未布置测压点位置的风压时间序列.第一种方案中利用插值技术获得没有测压点位置的本征模态值.第二种方案对参考屋盖和需预测的新屋盖分别进行试验,结合由参考屋盖试验萃取的本征模态和由新屋盖试验的风压数据计算的主坐标,预测出新屋盖未知区域的风压时间序列.文中对风压场重建和预测的效果作了分析,而且比较了根据测量的风压数据和预测的风压数据所计算的屋盖风致响应.